Simple characterizations for commutativity of quantum weakest preconditions
نویسنده
چکیده
In a recent letter by Ying et al. [Inf. Process. Lett. 104 (2007) 152-158], it showed some sufficient conditions for commutativity of quantum weakest preconditions. This paper provides some simple characterizations for the commutativity of quantum weakest preconditions, i.e., Theorem 3, Theorem 4 and Proposition 5 in what follows. We also show that to characterize the commutativity of quantum weakest preconditions in terms of [M,N ] (= MN − NM) is hard in the sense of Proposition 7 and Proposition 8.
منابع مشابه
Commutativity of quantum weakest preconditions
The notion of quantum weakest precondition was introduced by D’Hondt and P. Panangaden (Mathematical Structures in Computer Science 16(2006)429-451), and they presented a representation of weakest precondition of a quantum program in the operatorsum form. In this letter, we give an intrinsic characterization of the weakest precondition of a quantum program given in a systemenvironment model. Fu...
متن کاملQuantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest precondition semantics. Rather than trying to reduce quantum computation to probabilistic programming we develop a notion that is directly taken from concepts used ...
متن کاملar X iv : 0 90 6 . 45 86 v 1 [ qu an t - ph ] 2 5 Ju n 20 09 Hoare Logic for Quantum Programs ∗
Hoare logic is a foundation of axiomatic semantics of classical programs and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques for quantum program verification and to build a logical foundation of programming methodology for quantum computers, we develop a full-fledged Hoare logic for both partial and total correctness of q...
متن کاملGeneralised quantum weakest preconditions
Generalisation of the quantum weakest precondition result of D’Hondt and Panangaden is presented. In particular the most general notion of quantum predicate as positive operator valued measure (POVM) is introduced. The previously known quantum weakest precondition result has been extended to cover the case of POVM playing the role of a quantum predicate. Additionally, our result is valid in inf...
متن کاملSemantics of a purely quantum programming language
Quantum algorithm is the key to dig the potential power of quantum computing and make quantum computation more efficient than its classical analogue. However, present methods of designing quantum algorithms are too tricky and lack of systematic development. The aim of quantum programming languages is to deal with this problem and try to provide a high-level and unifying description and treatmen...
متن کامل